Fast Random Number Generation Using 128-Bit Multimedia Extension Registers on Pentium Class Machines
نویسنده
چکیده
In this work it is shown how 128 bit SSE2 multimedia extension registers, present in Pentium IV class 32 bit processors, may be used to generate random numbers at several times greater speed then when regular general purpose registers are used. In particular, a 128 bit algorithm is presented for the Marsaglia MWC1616 generator from the DIEHARD battery of random number generator tests, and its performance is compared to that of the conventional approach.
منابع مشابه
Simulational Methods Fast RandomNumber Generation Using 128-Bit Multimedia Extension Registers on Pentium ClassMachines
In this article, it is shown how 128-bit SSE2 multimedia extension registers, present in Pentium IV class 32-bit processors, may be used to generate random numbers at several times greater speed then when regular general purpose registers are used. In particular, a 128-bit algorithm is presented for the Marsaglia MWC1616 generator from the DIEHARD battery of random number generator tests, and i...
متن کاملar X iv : p hy si cs / 0 60 92 11 v 1 2 5 Se p 20 06 Fast random number generation using 128 bit multimedia extension registers on Pentium class
In this work it is shown how 128 bit SSE2 multimedia extension registers, present in Pentium IV class 32 bit processors, may be used to generate random numbers at several times greater speed then when regular general purpose registers are used. In particular, a 128 bit algorithm is presented for the Marsaglia MWC1616 generator from the DIEHARD battery of random number generator tests, and its p...
متن کاملAn Application of Finite Field: Design and Implementation of 128-bit Instruction-Based Fast Pseudorandom Number Generator
(1) SIMD-oriented Mersenne Twister (SFMT) is a new pseudorandom number generator (PRNG) which uses 128-bit Single Instruction Multiple Data (SIMD) operations. SFMT is designed and implemented on C language with SIMD extensions and also implemented on standard C without SIMD. (2) Properties of SFMT are studied by using finite field theories, and they are shown to be equal or better than Mersenne...
متن کاملLibrary of random number generators based on SSE command set
Pseudo random numbers, generated recursively by deterministic rules, represent one of important ingredients in algorithms for numerical simulations such as molecular dynamics and of Monte Carlo simulations, widely used in physics, chemistry, material science and cryptography [1]. It is a great challenge to design random number generators (RNGs) producing pseudo random numbers that behave as rea...
متن کاملAutomatic Generation of Vectorized Fast Fourier Transform Libraries for the Larrabee and AVX Instruction Set Extension
Introduction The discrete Fourier transform (DFT) and its fast algorithms (fast Fourier transforms or FFTs) are among the most important computational building blocks in signal processing and scientific computing. Consequently, there is a number of high performance DFT libraries available including Intel’s Integrated Performance Primitives (IPP), FFTW [6], and libraries generated by Spiral [9, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Communications in Statistics - Simulation and Computation
دوره 37 شماره
صفحات -
تاریخ انتشار 2008